Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generation
نویسندگان
چکیده
Learning the underlying distribution of molecular graphs and generating high-fidelity samples is a fundamental research problem in drug discovery material science. However, accurately modeling rapidly novel remain crucial challenging goals. To accomplish these goals, we propose Conditional Diffusion model based on discrete Graph Structures (CDGS) for graph generation. Specifically, construct forward diffusion process both structures inherent features through stochastic differential equations (SDE) derive as condition reverse generative processes. We present specialized hybrid noise prediction that extracts global context local node-edge dependency from intermediate states. further utilize ordinary equation (ODE) solvers efficient sampling, semi-linear structure probability flow ODE. also combine with gradient guidance molecule property predictor similarity-constrained optimization. Experiments diverse datasets validate effectiveness our framework. Particularly, proposed method still generates high-quality limited number steps.
منابع مشابه
Graph construction and random graph generation for modeling protein structures
Researchers often model folded protein structures as graphs with amino acids as the vertices and edges representing contacts between amino acids. The vertices in these graphs are naturally ordered in the amino acid sequence order. There are many different graph construction methods and there is no consensus about what construction to use or what the major issues are with each construction in th...
متن کاملGraph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness
We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a nodeand edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-...
متن کاملIterative Conditional Fitting for Discrete Chain Graph Models
‘Iterative conditional fitting’ is a recently proposed algorithm that can be used for maximization of the likelihood function in marginal independence models for categorical data. This paper describes a modification of this algorithm, which allows one to compute maximum likelihood estimates in a class of chain graph models for categorical data. The considered discrete chain graph models are def...
متن کاملDiscrete-Time Quantum Walks and Graph Structures
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the...
متن کاملAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i4.25549